The Complexity of the Word-problem for Finite Matrix Rings

نویسنده

  • CSABA SZABÓ
چکیده

We analyze the so-called word-problem for M2(Z2), the ring of 2 × 2 matrices over Z2. We prove that the term-equivalence problem for the semigroup (and so for the ring) M2(Z2) is coNP-complete.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

Matrix representation of a sixth order Sturm-Liouville problem and related inverse problem with finite spectrum

‎In this paper‎, ‎we find matrix representation of a class of sixth order Sturm-Liouville problem (SLP) with separated‎, ‎self-adjoint boundary conditions and we show that such SLP have finite spectrum‎. ‎Also for a given matrix eigenvalue problem $HX=lambda VX$‎, ‎where $H$ is a block tridiagonal matrix and $V$ is a block diagonal matrix‎, ‎we find a sixth order boundary value problem of Atkin...

متن کامل

The characteristics of mathematical word problems at the middle school and suggested strategies to facilitae their solution process

Abstract: This paper, first it has reviewed the literature on the characteristics of mathematical word problems and their solution process. The review revealed that among the root causes for students’ difficulties with mathematical word problems, two factors are salient, namely the text complexity and the unfamiliar context. To shed more light on these findings, a factorial experimental study w...

متن کامل

ON THE REFINEMENT OF THE UNIT AND UNITARY CAYLEY GRAPHS OF RINGS

Let $R$ be a ring (not necessarily commutative) with nonzero identity. We define $Gamma(R)$ to be the graph with vertex set $R$ in which two distinct vertices $x$ and $y$ are adjacent if and only if there exist unit elements $u,v$ of $R$ such that $x+uyv$ is a unit of $R$. In this paper, basic properties of $Gamma(R)$ are studied. We investigate connectivity and the girth of $Gamma(R)$, where $...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004